IEOR 269 , Spring 2010 Integer Programming and Combinatorial Optimization

Myths and Counterexamples in Integer Programming and Combinatorial Optimization

AN OPTIMIZATION METHOD TO DETERMINE THE LEAST COMMON MULTIPLY

This paper proposes an Integer Programming model to obtain the Least Common Multiply (LCM) for some integer numbers. The proposed method is illustrated by a numerical example.  

Universally Balanced Combinatorial Optimization Games

This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivis...

MSRI Summer Graduate Workshop: Algebraic, Geometric, and Combinatorial Methods for Optimization Part IV Geometry of Numbers and Rational Generating Function Techniques for Integer Programming

Cardinality constrained combinatorial optimization: Complexity and polyhedra

Given a combinatorial optimization problem and a subset N of natural numbers, we obtain a cardinality constrained version of this problem by permitting only those feasible solutions whose cardinalities are elements of N . In this paper we briefly touch on questions that addresses common grounds and differences of the complexity of a combinatorial optimization problem and its cardinality constra...